Rulebased Knowledge Representation Inspired from Finite Automata
نویسندگان
چکیده
منابع مشابه
Rule-based Knowledge Representation Inspired from Finite Automata
In this paper we present a method for rule based knowledge representation. The proposed approach is inspired from Finite Automata (FA). The inspired FA diagrams are easily used to represent rule-based system and make it more reliable structure in large complicated systems. One of the major additions that gives the proposed structure its significance is that it can represent the rules such that ...
متن کاملRepresentation of Finite State Automata
In this paper, we propose some techniques for injecting nite state automata into Recurrent Radial Basis Function networks (R 2 BF). When providing proper hints and constraining the weight space properly, we show that these networks behave as automata. A technique is suggested for forcing the learning process to develop automata representations that is based on adding a proper penalty function t...
متن کاملImage Representation Using Finite State Automata
Image representation using quadtrees is useful in many applications and is well known in computer graphics. It has been shown that we can represent quadtrees asrationallanguages that are recognizable by finite state automata (FSA) [1]. These FSA can use less memory and are more flexible than their corresponding quadtrees. Binary image representation using FSA follows these two main steps: (1) F...
متن کاملSmaller Representation of Finite State Automata
This paper is a follow-up to Jan Daciuk’s experiments on space-efficient finite state automata representation that can be used directly for traversals in main memory [4]. We investigate several techniques of reducing the memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for ...
متن کاملOn the Representation of Finite Automata
We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFA’s) with n states over an alphabet of k symbols. We show how to generate all these strings for each n and k, and how its enumeration provides an alternative way to obtain the exact number of ICDFA’s. 1 Motivation In symbolic manipulation environments for finite automata, it is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/2493-3367